Isogenous tori and the class number formulae
نویسندگان
چکیده
منابع مشابه
Generalized Weierstrass Formulae, Soliton Equations and Willmore Surfaces I. Tori of Revolution and the Mkdv Equation
A new approach is proposed for study structure and properties of the total squared mean curvature W of surfaces in R 3. It is based on the generalized Weierstrass formulae for inducing surfaces. The quantity W (Will-more functional or extrinsic Polyakov action) is shown to be invariant under the modified Novikov–Veselov hierarchy of integrable flows. It is shown that extremals of W (Willmore su...
متن کاملThe Many Formulae for the Number of Latin Rectangles
A k×n Latin rectangle L is a k×n array, with symbols from a set of cardinality n, such that each row and each column contains only distinct symbols. If k = n then L is a Latin square. Let Lk,n be the number of k×n Latin rectangles. We survey (a) the many combinatorial objects equivalent to Latin squares, (b) the known bounds on Lk,n and approximations for Ln, (c) congruences satisfied by Lk,n a...
متن کاملNon-isogenous Superelliptic Jacobians
Let p be an odd prime. Let K be a field of characteristic zero and Ka its algebraic closure. Let n ≥ 5 and m ≥ 5 be integers. Let f(x), h(x) ∈ K[x] be irreducible separable polynomials of degree n and m respectively. Suppose that the Galois group of f is either the full symmetric group Sn or the alternating group An and the Galois group of h is either the full symmetric group Sm or the alternat...
متن کاملStyle-Consistency in Isogenous Patterns
In many applications of pattern recognition, patterns appear in groups (fields) that have a common origin. For example, a printed word is a field of character patterns printed in the same font. A common origin induces consistency of style among features measured on patterns. In the presence of multiple styles, the features of co-occurring patterns are statistically dependent through the underly...
متن کاملOn Hierarchies over the Class of SLUR Formulae
Single look-ahead unit resolution (SLUR) algorithm is a nondeterministic polynomial time algorithm which for a given input formula in a conjunctive normal form (CNF) either outputs its satisfying assignment or gives up. A CNF formula belongs to the SLUR class if no sequence of nondeterministic choices causes the SLUR algorithm to give up on it. The SLUR class is reasonably large. It is known to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyoto Journal of Mathematics
سال: 1991
ISSN: 2156-2261
DOI: 10.1215/kjm/1250519723